A polynomial time approximation algorithm for dynamic storage allocation
نویسندگان
چکیده
منابع مشابه
An algorithm with constant execution time for dynamic storage allocation
The predictability of the computation t ime of program modules is very important f o r estimating an accurate worst-case execution t ime ( W C E T ) of a task in real-time systems. Dynamic storage allocation ( D S A ) is a common programming technique. Although many DSA algorithms have been developed, they focus o n the average execution t ime rather than the W C E T , making it is very dif icu...
متن کاملA Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage
We consider a problem which has received considerable attention in systems literature because of its applications to routing in delay tolerant networks and replica placement in distributed storage systems. In abstract terms the problem can be stated as follows: Given a random variable X generated by a known product distribution over {0, 1}n and a target value 0 ≤ θ ≤ 1, output a non-negative ve...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملA Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly intersecting unit disks whose centers are in P . The task is to find a set B of m disks of maximum radius such that no disk in B intersects a disk in B ∪ R, where m is the maximum number of unit disks that can be packed. B...
متن کاملApproximation Algorithms and Heuristics for the Dynamic Storage Allocation Problem
In this report, we look at the problem of packing a number of arrays in memory efficiently. This is known as the dynamic storage allocation problem (DSA) and it is known to be NP-complete. We develop some simple, polynomial-time approximation algorithms with the best of them achieving a bound of 4 for a subclass of DSA instances. We report on an extensive experimental study on the FirstFit heur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90011-p